While dynamic epistemic logics with common knowledge have been extensively studied, dynamic epistemic logics with distributed knowledge have so far received far less attention. In this paper we study extensions of public announcement logic ( $\mathcal{PAL }$ ) with distributed knowledge, in particular their expressivity, axiomatisations and complexity. $\mathcal{PAL }$ extended only with distributed knowledge is not more expressive than standard epistemic logic with distributed knowledge. Our focus is therefore on $\mathcal{PACD }$ , the result of adding both common and (...) distributed knowledge to $\mathcal{PAL }$ , which is more expressive than each of its component logics. We introduce an axiomatisation of $\mathcal{PACD }$ , which is not surprising: it is the combination of well-known axioms. The completeness proof, however, is not trivial, and requires novel combinations and extensions of techniques for dealing with $S5$ knowledge, distributed knowledge, common knowledge and public announcements at the same time. We furthermore show that $\mathcal{PACD }$ is decidable, more precisely that it is $\textsc {exptime}$ -complete. This result also carries over to $\mathcal{S 5\mathcal CD }$ with common and distributed knowledge operators for all coalitions (and not only the grand coalition). Finally, we propose a notion of a trans-bisimulation to generalise certain results and give deeper insight into the proofs. (shrink)

We introduce a type of weighted modal logic with explicit weights both in the language and in the models. The framework has its applications in epistemic logic for reasoning about agents’ knowledge based on their capability, and in deontic logic for agents’ choices based on their deontic capability or utilities. We make use of weighted Kripke models with the weights understood epistemically as a similarity measure between states and deontically as a measure of expected utilities. We present sound and complete (...) axiomatizations for the logics, and discuss variants and possible extensions. (shrink)

We define balance games, which describe the formation of friendships and enmity in social networks. We show that if the agents give high priority to future profits over short term gains, all Pareto optimal strategies will eventually result in a balanced network. If, on the other hand, agents prioritize short term gains over the long term, every Nash equilibrium eventually results in a network that is stable but that might not be balanced.

​This volume brings together a group of philosophically oriented logicians and logic-minded philosophers, mainly from Asia, to address a variety of logical and philosophical topics, such as modal logic and related directions (e.g. temporal logic, epistemic logic, deontic logic, logic of conditionals, and modal proof theory), theory of truth, paradoxes, intentionality, and social networks. New approaches are also proposed, such as extended modal logic with planarity of graphs, extended branching time temporal logic with conditional operators, and a relational treatment of (...) language and logical systems, to name but a few.Given the variety of topics and issues discussed here, the book will appeal to readers from a broad range of disciplines, from mathematical/philosophical logic, computing science, cognitive science and artificial intelligence, to linguistics, game theory and beyond. (shrink)

This volume collects selected papers presented at the Second Chinese Conference on Logic and Argumentation in 2018 held in Hangzhou, China. The papers presented reflect recent advances in logic and argumentation, as well as the connections between the two, and also include invited papers contributed by leading experts in these fields. The book covers a wide variety of topics related to dynamics, uncertainty and reasoning. It continues discussions on the interplay between logic and argumentation which has a long history from (...) Aristotle’s ancient logic to very recent formal argumentation in AI. (shrink)